Multi-domain query completion

ABSTRACT

A method and apparatus of a device that performs a multi-domain query search is described. In an exemplary embodiment, the device receives a query prefix from a client of a user. The device further determines a plurality of search completions across the plurality of separate search domains. In addition, the device ranks the plurality of search completions based on a score calculated for each of the plurality of search completions determined by a corresponding search domain, where at least one of the plurality of search completions is used to generate a plurality of search results without an indication from the user and in response to receiving the query prefix.

RELATED APPLICATIONS

Applicant claims the benefit of priority of prior, provisionalapplication Ser. No. 62/005,996 filed May 30, 2014, the entirety ofwhich is incorporated by reference.

FIELD OF INVENTION

This invention relates generally to search technology and moreparticularly to searching over multiple search domains and incorporatinguser feedback into a citation search index.

BACKGROUND OF THE INVENTION

A user will often perform a query search to lookup information on theWeb or from some other data sources. A query search begins with a clientreceiving the query string, which is sent to a search server. The searchserver receives query string and searches a search index for resultsthat match this query string. The search server then returns the resultsto the client. In order to assist the user on the client, the searchserver may also suggest query completions based on a partially enteredquery string. The suggested query completions are completed query searchstrings that the search server has received in the past that includesthe client input partial query string. The suggested query completionsare presented to the user, so that the user can choose one of the querycompletions as the string to be used for the search.

After the client receives and presents the results, the user may engagewith some of the results (e.g., click on a link for one of the resultsand spend time interacting with the website referenced by that link) andmay also abandon some of these results. The search server, however, doesnot capture this user feedback so as to incorporate the feedback intoits search indices.

SUMMARY OF THE DESCRIPTION

A method and apparatus of a device that performs a multi-domain querysearch is described. In an exemplary embodiment, the device receives aquery prefix from a client of a user. The device further determines aplurality of search completions across the plurality of separate searchdomains. In addition, the device ranks the plurality of searchcompletions based on a score calculated for each of the plurality ofsearch completions determined by a corresponding search domain, where atleast one of the plurality of search completions is used to generate aplurality of search results without an indication from the user and inresponse to receiving the query prefix.

In another embodiment, the device generates a results cache usingfeedback from a user's search session. In this embodiment, the devicereceives a feedback package from a client, where the feedback packagecharacterizes a user interaction with a plurality of query results inthe search session that are presented to a user in response to a queryprefix entered by the user. The device further generates a plurality ofresults for a plurality of queries by, running the plurality of queriesusing the search feedback index to arrive at the plurality of results.In addition, the device creates a results cache from the plurality ofresults, where the results cache maps the plurality of results to theplurality of queries and the results cache is used to serve queryresults to a client.

In a further embodiment, the device generates a plurality of rankedquery results from a query over a plurality of separate search domains.In this embodiment, the device receives the query and determines aplurality of results across the plurality of separate search domainsusing the query. The device further characterizes the query. Inaddition, the device ranks the plurality of results based on a scorecalculated for each of the plurality of results determined by acorresponding search domain and the query characterization, where thequery characterization indicates a query type.

Other methods and apparatuses are also described.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention is illustrated by way of example and notlimitation in the figures of the accompanying drawings in which likereferences indicate similar elements.

FIG. 1 is a block diagram of one embodiment of a system that returnssearch results based on input query prefixes.

FIG. 2 is flowchart of one embodiment of a process to determine querycompletions and relevant results based on an input query prefix.

FIG. 3 is a block diagram of one embodiment of an aggregator andmultiple search domains.

FIG. 4 is an illustration of one embodiment to a query completion searchdomain.

FIG. 5 is an illustration of one embodiment of a maps search domain.

FIG. 6 is a flow chart of one embodiment of a process to determine querycompletions from multiple search domains.

FIG. 7 is a flow chart of one embodiment of a process to determinerelevant results over multiple search domains from a determined querycompletion.

FIG. 8 is a block diagram of one embodiment of a system thatincorporates user feedback into a feedback search index.

FIG. 9 is a flow chart of one embodiment of a process to incorporateuser feedback into a citation search index.

FIG. 10 is a flow chart of one embodiment of a process to collect userfeedback during a user search session.

FIG. 11 is a flow chart of one embodiment of a process to incorporateuser feedback during into a feedback index.

FIG. 12 is a flow chart of one embodiment of a process to use the userfeedback to update a results cache.

FIG. 13 is a block diagram of one embodiment of a federator thatperforms a multi-domain search using a characterized query completion.

FIG. 14 is a flow chart of one embodiment of a process to determinerelevant results using a vocabulary service.

FIG. 15 is a flow chart of one embodiment of a process to characterize aquery completion.

FIG. 16 is a block diagram of one embodiment of a completion module todetermine query completions from multiple search domains.

FIG. 17 is a block diagram of one embodiment of a results module todetermine relevant results over multiple search domains from adetermined query completion.

FIG. 18 is a block diagram of one embodiment of a collect feedbackmodule to collect user feedback during a user search session.

FIG. 19 is a block diagram of one embodiment of a process feedbackmodule to incorporate user feedback during into a feedback index.

FIG. 20 is a block diagram of one embodiment of an update query resultsmodule to use the user feedback to update a results cache.

FIG. 21 is a block diagram of one embodiment of a process feedbackmodule to incorporate user feedback during into a feedback index.

FIG. 22 is a block diagram of one embodiment of an update query resultsmodule to use the user feedback to update a results cache.

FIG. 23 illustrates one example of a typical computer system, which maybe used in conjunction with the embodiments described herein.

FIG. 24 shows an example of a data processing system, which may be usedwith one embodiment of the present invention.

DETAILED DESCRIPTION

A method and apparatus of a device that performs a multi-domain querysearch is described. In the following description, numerous specificdetails are set forth to provide thorough explanation of embodiments ofthe present invention. It will be apparent, however, to one skilled inthe art, that embodiments of the present invention may be practicedwithout these specific details. In other instances, well-knowncomponents, structures, and techniques have not been shown in detail inorder not to obscure the understanding of this description.

Reference in the specification to “one embodiment” or “an embodiment”means that a particular feature, structure, or characteristic describedin connection with the embodiment can be included in at least oneembodiment of the invention. The appearances of the phrase “in oneembodiment” in various places in the specification do not necessarilyall refer to the same embodiment.

In the following description and claims, the terms “coupled” and“connected,” along with their derivatives, may be used. It should beunderstood that these terms are not intended as synonyms for each other.“Coupled” is used to indicate that two or more elements, which may ormay not be in direct physical or electrical contact with each other,co-operate or interact with each other. “Connected” is used to indicatethe establishment of communication between two or more elements that arecoupled with each other.

The processes depicted in the figures that follow, are performed byprocessing logic that comprises hardware (e.g., circuitry, dedicatedlogic, etc.), software (such as is run on a general-purpose computersystem or a dedicated machine), or a combination of both. Although theprocesses are described below in terms of some sequential operations, itshould be appreciated that some of the operations described may beperformed in different order. Moreover, some operations may be performedin parallel rather than sequentially.

The terms “server,” “client,” and “device” are intended to refergenerally to data processing systems rather than specifically to aparticular form factor for the server, client, and/or device.

A method and apparatus of a device that performs a multi-domain querysearch is described. In one embodiment, the device receives incrementalquery prefixes from a client that are input by a user and uses theincremental query prefixes to generate a set of query completions foreach query prefix. For example and in one embodiment, if the user entersthe string “apple,” the device receives the incremental query prefixesfor “a,” “ap,” “app,” “appl,” and “apple.” For each of the queryprefixes, the device generates a set of query completions. For exampleand in one embodiment, the completions for “a” can be “apple.com,”“America,” or “Annapolis.” Similarly, the device can generate adifferent set of query completions for the other incremental queryprefixes. In one embodiment, the device determines the set of querycompletions from multiple search domains. For example and in oneembodiment, the device searches for query completions across searchdomains such as maps, media, wiki, site, and other search domains. Inone embodiment, each of these search domains includes one or more querycompletion trees that are used to determine possible completions for theinput query prefix. In one embodiment, each of the search domainsreturns a set of scores that the device uses to rank these querycompletions. For example and in one embodiment, each of search domainsreturns a set of raw, local, and global scores that can be used by thedevice to rank the different completions across the different domains.

As described above, traditional systems will returns possible querycompletions to the user and the user will select one of the possiblequery completions to use for a query search. In contrast and in oneembodiment, the device does not return the set of query completions tothe user. Instead, the device ranks the set of query completions anduses a subset of the query completions to determine relevant results forthis subset of query completions without presenting the set of querycompletions to the user or getting an indication which of this set ofquery completions to use to determine relevant results. In oneembodiment, the device performs a search for relevant results acrossmultiple search domains (e.g., maps, media, wiki, sites, other, oranother search domain). The device receives a set of results from themultiple search domains and ranks these results based on scoresgenerated from each search domain and cross-domain information. In oneembodiment, the device further ranks the relevant results based on atype of the query completion that was used to determine these results.For example and in one embodiment, if the query completion ischaracterized to be a search for a place, the results from the mapssearch domain can be ranked higher as well as a wiki entry about thisplace. As a further example, if the query completion is indicated to beabout an artist, the media search domain results can be ranked higher.The device returns the relevant results found for the query completionsto the client.

In one embodiment, the user viewing the results might engage or abandonthe results. In one embodiment, an engagement event occurs if the userinteracts with one of the rendered results presented to the user duringa user's search session. For example and in one embodiment, the usercould click on a link that is presented for one of the rendered results.In another example, the user could click on the link and spend a timegreater than a predetermined time interacting with the object (e.g., awebsite) referenced by that link (e.g., interacts with the referencedobject for more than 60 seconds). In this example, the user may receiveresults directed towards a query search for the current U.S. Presidentand click on a link that references a web page describing the latestpresidential speech. If the user interacts with the website for morethan a predetermined time (e.g., 60-90 seconds), the device woulddetermine that the user engaged with the result represented by thatlink. In another embodiment, the user may ignore or abandon resultsrendered for the user. For example and in one embodiment, if a userclicks on a link presented for one of the rendered results, butnavigates away from that website within a predetermined time (e.g., lessthan 60-90 seconds), the device determines that this is an abandonmentevent for that result.

In one embodiment, this feedback can be incorporated into a searchindex, where the feedback influences the ranking and filtering of therelevant results. In this embodiment, the client that presents andrenders the relevant results additionally collects the engagement andabandonment events for a user's search session. The client collects theevents into a feedback package and sends this package to a server forprocessing. In one embodiment, the server receives the feedback packageand converts the feedback package into a feedback index entry. In oneembodiment, the feedback index entry has the format of <query, result,render counts, engagement counts, abandonment counts>, where query isthe input query and context information such as, device type,application, locale, and geographic location, result is the renderresult, render counts is the number of times the result is rendered forthat query, engagement counts is the number of times the result isengaged for that query, and abandonment counts is the number of timesthat result is abandoned. This entry is incorporated into a feedbacksearch index. In one embodiment, the feedback search index is a searchindex that incorporates the users feedback into scoring results. Forexample and in one embodiment, each engagement events for a query resultpair promotes that result for the corresponding query. In this example,if a user engages with a result for a particular query, then a futureuser may also engagement with this result for the same query. Thus, inone embodiment, the result for this query would be returned and rankedhigher for a future user having the same query. Conversely, if a userabandons a result for a particular query, then a future user may alsoabandon this same result for the same query. Thus, in one embodiment,the result for this query may be returned and ranked lower for a futureuser having the same query.

In one embodiment, the server further uses the feedback search index togenerate a results cache that maps queries to results. In oneembodiment, the results cache is a cache that maps queries to results,which can be used to quickly return results for a user query. In oneembodiment, the results cache is stored in an edge server that is closein proximity to a user's device that can be used to serve one or moreresults prior to performing a query search. In one embodiment, theserver generates the results cache by running a set of queries from aresults set to generated an updated results set that incorporates thecollected feedback into the results of the update results set. Thisupdated results set is sent to the edge server.

FIG. 1 is a block diagram of one embodiment of a system 100 that returnssearch results based on input query prefixes. In FIG. 1, the system 100includes a search network 108 that is couple to device 102, smartphone114, and tablet 116. In one embodiment, the search network is a networkof one or more servers that receives query prefixes for differentdevices and returns query results back to those devices. For example andin one embodiment, the search network receives query prefixes 110A-Dfrom device 102, smartphone 114, and/or tablet 116 and returns queryresults 112A-D back to the respective device (e.g., device 102,smartphone 114, and/or tablet 116). In one embodiment, the device 102can be personal computer, laptop, server, mobile device (e.g.,smartphone, laptop, personal digital assistant, music playing device,gaming device, etc.), and/or any device capable requesting and/ordisplaying a query. In one embodiment, the device can be a physical orvirtual device. In one embodiment, the smartphone 114 can be a cellulartelephone that is able to perform many function of device 102. In oneembodiment, the tablet 116 can be a mobile device that accepts input ona display.

In one embodiment, each of the devices includes a browser that is usedto input a query prefix by the user. For example in one embodiment,device 102 includes a web browser 104 and file browser 106. Each ofthese browsers includes a search input field that is used by the user toinput the query prefix. In one embodiment a web browser 104 is a programthat all that allows a user to search and retrieve the web for varioustype of web documents. In one embodiment, the web browser 104 includes asearch input field 128. The search input field 128 is used by the userto input a query prefix string. In one embodiment, a query prefix stringis a string of text or other symbols that will be used in the queryprefix that is sent to the search network 108. The query prefix stringcan be an incomplete or complete search string that was input by theuser. In one embodiment as the user types in the query input string inthe search input field 120A, the web browser 104 captures the queryprefix string and sends this query prefix string in a query prefix 110 Ato the search network. For each symbol or text string entered in thesearch input field 120A, the web browser 104 creates the query prefix110A and sends it to the search network 108. In response to receivingthe query prefix 110A, the search network creates one or more querycompletions over multiple search domains and selects one or more ofthese query completions to create a set of relevant results 112, whichis returned to the web browser 104. For example and in one embodiment,as the user enters the text “appl”, the web browser 104 creates queryprefixes 110A using the query prefix strings “a”, “ap”, “app”, and“appl”. For each of these query prefixes 110A, the search network 108creates a set of query completions from multiple search domains, usesthese query completions to determine relevant results, and returns adifferent set of results for the different query prefixes 110A. Thisprocedure of capturing query prefixes as the user enters the subsequentcharacters can also be done in a file browser 106. In one embodiment,the file browser 106 includes a search input field 120B, which a usercan use to input a query prefix string. In this embodiment, as a userinputs the query prefix string, the file browser 106 creates differentquery prefixes 110B and sends them to the search network 108. The searchnetwork 108 receives the different query prefixes 110B and determinesthe one or more query completions and returns relevant results asdescribed above. In addition, the query prefixes can be used to performa query using a metadata database of data stored locally on device 102.

In one embodiment, this same procedure of capturing a query input stringas the strings is entered, determining one or more query completions,and using these query completions to determine relevant results can alsobe performed on the smartphone 114 and tablet 116. In this embodiment,the smart phone 114 includes a browser 116. The browser 116 includes asearch input field 120C. Similar as described above, the search inputfield 120C is used by a user to input a query prefix string. This queryprefix string is incrementally captured by the browser 116, which, inturn, creates a set of different query prefixes 110C that is sent to thesearch network 108. In response to receiving the each of these differentquery prefixes 110C, the search network 108 determines one or more querycompletions, and uses these query completions to determine relevantresults 112C that are returned back to browser 116. In addition, thetablet 116 includes a browser 118. The browser 118 includes a searchinput field 120D. Similar as described above, the search input field120D is used by a user to input a query prefix string. This query prefixstring is incrementally captured by the browser 118, which in turncreates a set of different query prefixes 110D that is sent to thesearch network 108. In response to receiving each of these differentquery prefixes 110D, the search network 108 determines one or more querycompletions, and uses these query completions to determine relevantresults 112D that are returned back to browser 118. In one embodiment,the search network 108 includes a search module 118 that processes thequery completion and returns relevant results. Processing the querycompletions and returning relevant results is further described in FIGS.2-7 below.

As described above, a browser on a device sends query prefixes 110A-D tothe search network 108. In one embodiment a query prefix 110A-D includesa query prefix string, the location (e.g., latitude/longitudecombination), a device type identifier (e.g., computer, smartphone,tablet, etc.), and application type identifier (e.g., web browser (andwhat type of web browser), file browser), and locale. In thisembodiment, by providing the location, device type identifier,application type identifier, and locale, the context in which the queryprefix string was entered by the user is provided to the searchednetwork 108. In one embodiment, the search network 108 uses this contextand the query prefix string to determine the query completions andrelevant results. For example and in one embodiment, the search network108 can use the location information to determine query completions andresults that are relevant to the location of the device that providedthe query prefix. As an example, the device location can be used to findsearch results for places near the current device location. As anotherexample and in another embodiment, the device type identifier can beused by the search network 108 to determine completions and results thatare directed to that device type. In this example, if the device typeidentifier indicated that the query prefix was coming from a smartphone,the search network 108 may give greater weight to results to anapplication store for the smartphone instead of an application store forpersonal computer. In a further example and in further embodiment, theapplication type identifier and locale can also be used to weightcompletions and results.

In one embodiment, the search network 108 completes the query prefixesusing a multi-domain query completion. In this embodiment, the searchnetwork 108 sends each received query prefix to each of the searchdomains used by the search network 108. For example and in oneembodiment, the search network 108 sends a received a query prefix tothe map search domain, media search domain, wiki search domain, sitessearch domain, and other search domains. Each of these search domainswould determine one or more query completions for that query prefixbased on the data contained in that search domain. In addition, eachsearch domain would return a set of scores for each of the one or morequery completions. For example and in one embodiment, a search domainwould return a raw, local, and/or global score for each querycompletion. Performing the multi-domain query completion is furtherdescribed in FIGS. 3-6.

Instead of returning the query completions determined by the searchnetwork 108 to the device that provided the query prefix, the searchnetwork 108 uses one or more of the query completions to determine a setof relevant query results over multiple search domains. In oneembodiment, using the query completions to determine a set of relevantquery results is performed without an indication from the user as towhich of these query completions to use to determine the relevantresults. In this embodiment, as the user inputs a string into the searchinput field, the search network 108 processes the string and returnsrelevant results to the user. In one embodiment, the search network 108uses one or more of the determined query completions to find and rankquery results for those query completions. In one embodiment, the searchnetwork 108 searches over the multiple search domains that are availableto the search network 108. In this embodiment, the search network 108receives from each search domain a set of results for query completion.For each of these results, the search network 108 additionally receivesa set of scores that characterizes that result. In one embodiment, thescores can include scores determined by the search domain the providedthe result, another metric, and/or a signal that characterizes the querycompletion that was used to provide the result as described below inFIG. 7. In one embodiment, the signal is based on a vocabularycharacterization of the query completion using a knowledge base. In oneembodiment, the vocabulary characterization determines what type ofquery completion is being used for the multi-domain query search.Performing a multi-domain query search to determine a set of relevantresults is further described in FIGS. 7 and 13-15 below.

FIG. 2 is flowchart of one embodiment of a process 200 to determinequery completions and relevant results based on an input query prefix.In FIG. 2, process 200 begins by receiving a query prefix. In oneembodiment, the query prefix includes a query prefix string, a location,a device type identifier, an application type identifier, and a localeas described in FIG. 1 above. In this embodiment, the location, devicetype identifier, application type identifier, and/or locale give acontext for the query prefix that the query prefix string was input bythe user. At block 204, process 200 determines query completions acrossmultiple search domains and ranks and selects the query completions. Inone embodiment, process 200 uses the query prefix to determine a set ofquery completions from each of the different such domains. For exampleand in one embodiment, if the query prefix string is ‘ap’, process 200would use this query prefix string to determine the set of querycompletions from the different search domains (e.g., maps, media, wiki,sites, and/or other search domains). In this example, the maps searchdomain might return a query completion to the city Apache Junction, themedia search domain by return a query completion to the music workAppalachian Spring, the wiki search domain might return a querycompletion to the company Apple, and the sites search domain my return aquery completion to the website Apple.com. In one embodiment, process200 creates the set of query completions if the query prefix string hasa minimum number of characters (e.g., four characters).

In addition, process 200 ranks and selects the possible querycompletions received from the different such domains. In one embodiment,process 200 ranks the possible query completions based on scoresdetermined by the corresponding search domain and weights based on thecontext of the query prefix. In this embodiment, process 200 selects theset of query completions based on these rankings. In one embodiment,instead of returning the set of query completions back to the user whoinput the query prefix string used for the great completions, this setof query completions is used to determine a set of relevant results,which are then returned to the user. Determining a set of querycompletions is further described in FIGS. 3-6 below.

Process 200 determines the set of relevant results at block 206. In oneembodiment, process 200 determines the relevant results based on thequery completions determined in block 204. In this embodiment, process200 searches over the multiple search domains that are available toprocess 200. In this embodiment, process 200 receives from each searchdomain a set of results for the query completion(s). For each of theseresults, process 200 additionally receives a set of scores thatcharacterizes that result. In one embodiment, the scores can includescores determined by the search domain the provided the result, anothermetric, and/or a signal that characterizes the query completion that wasused to provide the result as described below in FIG. 7. In oneembodiment, the signal is based on a vocabulary characterization of thequery completion using a knowledge base. In one embodiment, thevocabulary characterization determines what type of query completion isbeing used for the multi-domain query search. Determining the set ofrelevant results is further described in FIGS. 7 and 13-15 below. Atblock 208, process 200 returns the set of relevant results to the user.In another embodiment, the feedback index can be used as a signal domainto weight results. This embodiment is further described in FIG. 14below.

As described above, process 200 determines query completions andrelevant results over multiple search domains. In one embodiment, thequery completions and relevant results our aggregated using anaggregator. FIG. 3 is a block diagram of one embodiment of a system 300that includes an aggregator 302 and multiple search domains 304A-F. Inone embodiment, the aggregator 302 receives requests for querycompletions based on an input query prefix. In response to receiving theinput query prefix, the aggregator 302 sends the input query prefix toeach of the search domains 304A-F. Each of the search domains 304A-Fuses the input query prefix to determine possible query completions inthat domain. For example and in one embodiment, the map search domain304A receives an input query prefix and searches this domain forpossible query completions. In one embodiment, the aggregator 302receives the query completions from each of the search domains, andranks the received query completions based on the scores for each of thecompletions determined by the corresponding search domain and weightsbased on the query prefix context.

In one embodiment, the maps search domain 304A is a search domain thatincludes information related to a geographical map. In this embodiment,the maps information can include information about places, addresses,places, businesses, places of interest, or other type of informationrelating to maps. In another embodiment, the maps information can alsoinclude information related to places of interest, such as openinghours, reviews and ratings, contact information, directions, and/orphotographs related to the place. In one embodiment, the media searchdomain 304B is a search domain related to media. In one embodiment, themedia search domain 304B includes information related to music, books,video, classes, spoken word, podcasts, radio, and/or other types ofmedia. In a further embodiment, the media search domain 304B can includeinformation related to applications that can run on the device, such asdevice 102, smartphone 114 and tablet 116 as described above in FIG. 1.In one embodiment, the media search domain is a media store thatincludes different types of media available for purchase (e.g., music,books, video, classes, spoken word, podcasts, radio, applications,and/or other types of media). In one embodiment, the wiki search domain304C is an online encyclopedia search domain. For example and in oneembodiment, wiki search domain 304C can be WIKIPEDIA. In one embodiment,the sites search domain 304D is a search domain of websites. For exampleand in one embodiment, the sites search domain 304D includes business,governmental, public, and/or private websites such as “apple.com,”“whitehouse.gov,” “yahoo.com,” etc. In one embodiment, the other searchdomain 304E is a set of other search domains that can be accessed by theaggregator 302 (e.g., a news search domain). One embodiment, thefeedback completion domain 304F is a search index that is based on queryfeedback collected by browsers running on various devices. In oneembodiment, the feedback completion domain 304F includes a feedbackindex that maps queries to results based on the collected queryfeedback. The feedback index is further described in FIGS. 8-12 below.

As described above, each search domain 304A-F includes information thatallows each of the search domains to give a set of query completionsbased on an input query prefix. In one embodiment, each of the searchdomains includes a query completion tree that is used to determine thequery completion as well as determine scores for each of those querycompletions. FIG. 4 is an illustration of one embodiment to a querycompletion search domain 402. In FIG. 4, the query completion searchdomain 402 includes a query completion tree 400 that has nodes 404A-J.In one embodiment, each of the nodes 404A-J represents a character in arespective language. In this embodiment, by following the nodes 404A-Jdown the tree, different query completions can be represented. Forexample and in one embodiment, starting at node 404A and following downto node 404C, completions that start with the letters ‘ap’ can berepresented. Each node also includes a frequency, which is the number oftimes this completion has been matched by an input query prefix. In oneembodiment, node 404C has a frequency of N. In this embodiment, thefrequency is represented as the raw score that is returned to theaggregator 302 above. In one embodiment, the frequency can be calculatedbased on logs (e.g., maps or media search domains), pages visited (e.g.,wiki search domain), or another source of information. Under node 404C,there are number of possible other query completions. For example and inone embodiment, nodes 404D-F represents the query completions that startwith the letters ‘apa’, ‘apt’, and ‘app’. The total number of possiblequery completions underneath the node gives an indication of closenessfor that query completion represented by that node. If the node has alarge number of possible other nodes below it, the query completionrepresented by that node is unlikely to be a good completion. On theother hand, a node that has relatively few nodes underneath that node,this node may be a good completion. In one embodiment, local score forthat node is represented by that node's frequency divided by the numberof completions represented by the subtrees below that node. In oneembodiment, the equation for the local score is represented by equation(1):

$\begin{matrix}{{{local}\mspace{14mu}{score}\mspace{14mu}({node})} = \frac{{Frequency}({node})}{{Number}\mspace{14mu}{of}\mspace{14mu}{completions}\mspace{14mu}{below}\mspace{14mu}{the}\mspace{14mu}{node}}} & (1)\end{matrix}$In one embodiment, each query completion tree includes the total numberof completions. This value is used to compute the global score forcompletion (or node). In one embodiment, the equation for the globalscore is represented by equation (2):

$\begin{matrix}{{{global}\mspace{14mu}{score}\mspace{14mu}({node})} = \frac{{Frequency}({node})}{{Number}\mspace{14mu}{of}\mspace{14mu}{completions}\mspace{14mu}{in}\mspace{14mu}{the}\mspace{14mu}{query}\mspace{14mu}{completion}\mspace{14mu}{tree}}} & (2)\end{matrix}$In one embodiment, the raw, local, and global scores for each querycompletion are returned to the aggregator by the search domain.

FIG. 5 is an illustration of one embodiment of a maps search domain 500.In FIG. 5, the map search domain 500 includes query completion trees504A-D for different zoom levels of this domain. In one embodiment, themap search domain 500 includes a query completion tree for the citylevel 504A, the county level 504B, the state level 504C, and the countrylevel 504D, which are aggregated by the maps aggregator 502. In thisembodiment, a determination of query completions for input query prefixis received by the maps aggregator 502, which in turn, determines querycompletions for that input query prefix at the different zoom levels504A-D of the map search domain 500. The maps aggregator 502 retrievesthe possible query completions from each of the different zoom levels504A-D, aggregates the query completions, and returns these querycompletions to the aggregator (e.g., aggregator 302). Thus, the mapsearch domain 500 determines query completions across different zoomlevels. In one embodiment, the map search domain 500 includesinformation about addresses, places, businesses, places of interest,and/or any other information relating to maps. In one embodiment, themap search domain 500 can include directory information, such as a whiteor yellow pages directory. In one embodiment, the media search domain isorganized by storefront, which is based on a combination of deviceidentifier and locale. In this embodiment, there is a query completiontree for each storefront.

FIG. 6 is a flow chart of one embodiment of a process 600 to determinequery completions from multiple search domains. In one embodiment,aggregator 302 performs process 600 to determine query completions frommultiple search domains. In FIG. 6, process 600 begins by receiving aquery prefix at block 602. In one embodiment, the query prefix includesa query prefix string in a context as described above in FIG. 2. Atblock 602, process 600 sends the query prefix to different searchdomains to determine possible completions. In one embodiment, process600 sends the query prefix to the maps, media, wiki, sites, and/or othersearch domains, where each of the search domains determines possiblequery completions for the input query prefix based on the querycompletion tree(s) that are available for each of those search domainsas described in FIG. 4 above. Process 600 receives the possible querycompletions from each of the search domains at block 606. In addition toreceiving the possible query completions, process 600 also receives aset of scores for each of the possible completions: e.g., a raw, local,and/or global score as described in FIG. 4 above. At block 608, process600 ranks and filters the possible query completions based on thereturned scores and the context of the input query prefix. In oneembodiment, process 600 tanks the possible query completions based onthe raw, local, and global scores received from the different searchdomains and the context included with the query prefix. Process 600additionally filters the possible query completions based on a set ofrules. For example and in one embodiment, a filter rule could be thatprocessed 600 filters out possible completions that have a raw score ofone or less than some predetermined value. Process 600 sends the ranked,filtered completions to the search query module, where the search querymodule uses the set of rank filtered query completions to determine aset of relevant results that will be returned to the user at block 610.

As described above, the query completions determined by process 600 areused to determine relevant results without sending these completionsback to the user. FIG. 7 is a flow chart of one embodiment of a process700 to determine relevant results over multiple search domains from adetermined query completion. In one embodiment, the federator 824performs process 700. In FIG. 7, process 700 receives the querycompletions from the completer at block 702. In one embodiment, thereceived query completions are the completions determined by process 600in response to receiving a query prefix. At block 704, process 700 sendsthe query completions to the different search domains to determinepossible relevant results. In one embodiment, each of the search domainsuses the received query completions to determine relevant results forthat search domain. At block 706, process 700 receives the query resultsfrom the different search domains. In one embodiment, process 700receives the results and the scores associated with each result that arecomputed by the relevant search domain.

Process 700 ranks and filters the search results at block 708. In oneembodiment, process 700 ranks the search results based on scoresreturned by each of the searched domains for the search results andother factors. In this embodiment, the scores from the different domainscan be scored based on domain-dependent scores, query independentscores, and query dependent scores. In one embodiment, each of thedifferent search domains can provide specific data that is used to rankthe returned results. For example and in one embodiment, the maps searchdomain can provide a variety of query independent information to rankthe results: number of online reviews, average review score, distancefrom the user (e.g., based the query prefix location information), ifthe result has a Uniform Resource Locator (URL) associated with theresult (e.g., if the result is a business location, if the business hasa URL reference a website or other social media presence), and/or thenumber of click counts. As another example and another embodiment, themedia search domain can provide other type of information for scoring:media rating count, age of the media, popularity, decayed popularity,and/or buy data by result. In a further example and embodiment, the wikisearch domain can provide information regarding page views, edithistory, and number of languages that can be for ranking. Other searchdomain can provide scoring metrics such as number of citations and age.

In one embodiment, process 700 receives a set of scores from each searchdomain and uses these scores to determine an initial score for each ofthe results. Process 700 applies a signal domain to each of the results.In one embodiment, a signal domain is a query completioncharacterization. In this embodiment, process 700 characterizes each ofthe query completions and uses this query completion characterization torank the results. For example and in one embodiment, process 700performs a vocabulary characterization utilizing a knowledge base todetermine what a type for the query completion. In this example, a querycompletion type indicates whether the query completion is determining aperson, place, thing, and/or another category. For example and oneembodiment, process 700 could determine that a query completion is beingused to determine a place. In this example, because the query completionis used to determine a place, the query results from the maps searchdomain would be weight (and ranked) higher in the ranking of the searchresults. The query completion characterization is further described inFIGS. 13-15 below.

In another embodiment, process 700 applies boosts to each of the resultscores. In this embodiment, process 700 applies a query deservesfreshness to each of the results. In one embodiment, query deservefreshness means that if there are recent spikes or peaks in the numberof counts for that results, this result is a “fresh” result, which couldbe boosted. A result with a count that fluctuates around a baseline overtime would not be a “fresh” result and would not be boosted. In oneembodiment, the counts are based on analysis of a social media feed(e.g., Twitter, etc.).

For example and in one embodiment, if the query completion was “puppylove” and four results were returned: (1) the song “Puppy Love” from themedia search domain; (2) a business called “Puppy Love Dogs” from themaps search domain; (3) a news article referring to a puppy lovecommercial; and (4) a wiki entry called “Puppy Love”. In thisembodiment, there is initial scoring of each result based on searchdomain dependent metrics: {age, rating, and raw score} from the mediasearch domain; {distance from user, has URL, number of reviews, averagereview} from the maps search domain; {age, news score, trackback count}from the news domain; and {page rank, raw score} from the wiki searchdomain. Each of the search domain provides its own scoring to process700. In this example, the scoring of each result could be initially rankas wiki result>media result>news result>maps result. Process 700 furtherapplies a signal domain to each of the results. In this example, thequery “puppy love” is characterized as a song and possibly a place.Applying this characterization would boost the media store result and,to a lesser extent, the maps result. After applying the characterizationboosts, the results scoring may be ranked wiki result>media result (butcloser in score)>maps result>news result. In addition, process 700applies query deserved boosts to the results. For example, because it istwo days after the initial airing of the “Puppy Love” commercial, thereis a boost in the counts for this commercial. Thus, the “Puppy Love”result would get a query deserves freshness boost. In this example, thenews result “Puppy Love” would get a big boost so that the results wouldrank as news result>wiki result>media result>maps result.

In one embodiment, process 700 additionally filters the search results.In this embodiment, process 700 removes results based on certain rules.For example and in one embodiment, process 700 may remove results thatbelow a certain overall score. Alternatively, process 700 can filterresults based on another criteria (e.g., Poor text match to query, lowclick-through rate, low popularity, results with explicit content and/orprofanity, and/or a combination thereof). At block 710, process 700returns the ranked, filtered results to the user.

FIG. 8 is a block diagram of a system 800 that incorporates userfeedback into a search index. In FIG. 8, the system 800 includes adevice 802 that sends query prefix(es) 828 to an edge server 804, whichin turn returns query results 830 back to the device. In addition, theedge server 804 is coupled to a core server 816. In one embodiment, thedevice 802 sends the query prefix(es) 828 to the edge server as the userenters in the query prefix. For example and in one embodiment, if theuser types in the query prefix “apple,” a query prefix is generated for“a,” “ap,” “app,” “appl,” and “apple” and sent to the edge server 804 asthe user enters each character. In addition, for each query prefix 828sent to the edge server 804, the edge server 804 returns relevantresults 830 to the client. For example and in one embodiment, the edgeserver would return relevant results for the query prefixes 828 “a,”“ap,” “app,” “appl,” and “apple” as the user enters each character. Inone embodiment, the edge server can also perform the query completion.In one embodiment, the device 802 further collects feedback regarding auser's search session, collects this feedback into a feedback package832, and sends the feedback package to the edge server. Collecting andsending of the feedback is further described in FIG. 10 below. In oneembodiment, the device 802 includes a collect feedback module 838 tocollect and send feedback.

In one embodiment, the edge server 804 includes a feedback module 806that further includes a feedback search module 808 and feedbackcollection module 810. In one embodiment, the feedback search module 808performs a search for each of the query prefix(es) 828 based on afeedback index 814 stored on an edge cache 812 of the edge server 804.In this embodiment, as the user enters a query prefix 828, a new set ofrelevant results 830 is returned to the device 802 using the feedbacksearch module 808 and the feedback search index 814. In one embodiment,a feedback search index is an index that incorporates the user'sfeedback into the search index. In this embodiment, the feedback searchindex is a results cache that is used to quickly serve results 830 backto the device. In one embodiment, the feedback search index is acitation search index and is further described with reference to FIG. 11below. In one embodiment, the feedback collection 810 collects thefeedback packages sent from device 802 and forwards the feedback packageto the core server 816.

In one embodiment, the core server 816 includes a feedback feed pipeline818, feedback decision pipeline 822, feedback index 820, and federator824. In one embodiment, the feedback feed pipeline 818 receives the rawfeedback packages 834 from the edge server 804 and converts each ofthese raw feedback packages 834 into entries for the feedback index 820.In one embodiment, the feedback feed pipeline 818 converts each of theraw feedback packages into a set of index entries with the format of<query, result, render counts, engagement counts, abandonment counts>,where query is the input query and context information such as, devicetype, application, locale, and geographic location, result is the renderresult, render counts is the number of times the result is rendered forthat query, engagement counts is the number of times the result isengaged for that query, and abandonment counts is the number of timesthat result is abandoned. In this embodiment, these index entries areadded to the feedback index 820. Updating a feedback index with the rawfeedback packages is further described in FIG. 11 below. In oneembodiment, the feedback index 820 is a search index that incorporatesthe user's feedback. The feedback feed pipeline 818 further includes aprocess feedback module 840 that updates a feedback index with the rawfeedback packages.

In one embodiment, the feedback decision pipeline 822 updates a resultsset using the feedback index 820. In one embodiment, a results set is amap between a set of queries and results. In this embodiment, thefeedback decision pipeline 822 runs a set of queries against thefeedback index 820 to determine an updated results set. In thisembodiment, the updated results set is sent to the federator 824. Thefeedback decision pipeline 822 additionally sends the updated resultsset 826 to the edge server 804. The updated results set 826 includes theresults for the set of queries that are determined using the updatedfeedback index 820. In one embodiment, the feedback decision pipeline822 includes an update results module 842 that updates the results set.Updating the results set is further described in FIG. 12 below. In oneembodiment, the feedback decision pipeline 822 additionally sends theupdated results set to a feedback archive 836 that stores the updatedresults set 826. In one embodiment, the federator 824 performs amulti-domain search using completed queries as described in FIGS. 13-15below.

As described above, the search network captures user feedback withrespect to a user's search session and uses this feedback to build asearch feedback index. FIG. 9 is a flow chart of one embodiment of aprocess 900 to incorporate user feedback into a citation search index.In FIG. 9, process 900 begins by collecting the user feedback for auser's search session. In one embodiment, process 900 start collectingfeedback at a device that received the query results in response to aquery prefix that was sent to the search network. In this embodiment,process 900 collects the feedback by detecting an initial render event(or another event (e.g., begin input of a query prefix) and determiningthe user's interactions in the search session. In one embodiment, a userinteraction can be maintaining focus on a website referenced by aresults, clicking on a link or other reference on that website, oranother type of interaction. In one embodiment, a search session is aset of events initiated by the user beginning an input of a queryprefix, tracking the user's actions over a rough period of time (e.g.,15 minutes). In one embodiment, process 900 records the query prefixsent out, the relevant results that are rendered for the user, if theuser engages with any of these render results (“engagement events”), andif the user abandons the rendered results (“abandonment events”). In oneembodiment, process 900 records if the user engages in alternate searchoptions.

In one embodiment, an engagement event occurs if the user interacts withone of the rendered results presented to the user. For example and inone embodiment, the user could click on a link that is presented for oneof the rendered results. In another example, the user could click on thelink and spend a time greater than a predetermined time interacting withthe object (e.g., a website) referenced by that link (e.g., interactswith the referenced object for more than 60 seconds). In this example,the user may received results directed towards a query search for thecurrent U.S. President and click on a link that references a web pagedescribing the latest presidential speech. If the user interacts withthe website for more than a predetermined time (e.g., 60-90 seconds),process 900 would determine that the user engaged with the resultrepresented by that link. Thus, this would be an engagement event forthis result. In one embodiment, hovering over a link can be recorded asengagement. In another embodiment, a user can also observe a displayedresult for a certain period of time. In this embodiment, depending onthe type of result, and the action following the period of time, anaction otherwise recorded as abandonment may be recorded as engagementinstead, or vice versa. For example and in one embodiment, if a userqueries for the “population of china” and is displayed a result, and theuser pauses for 10 seconds before deleting the query, this event mayberecorded as an engagement instead of an abandonment event.

In another embodiment, the user may ignore or abandon results renderedfor the user. For example and in one embodiment, if a user clicks on alink presented for one of the rendered results, but navigates away fromthat website within a predetermined time (e.g., less than 60-90seconds), process 900 determines that this is an abandonment event forthat result. In one embodiment, there are other types of abandonmentevents: continuing to type more characters (extending the query prefix);changing focus to another window or application; deleting the query;backspacing one or more characters or otherwise editing the query;engaging with anything other than what was presented as a result can berecorded as an abandonment of that result. In one embodiment, the user'sactions are recorded along with time intervals spent by the user, whichcan change the interpretation of what would otherwise be an abandonmentto an engagement or vice versa.

In one embodiment, a user's search session can end after a predeterminedtime, whether in length of user session, time of inactivity, or someother metric. In response to a search session ending, process 900assembles the collected events for this search session into a feedbackpackage that is sent to the search network. Collecting the feedback isfurther described in FIG. 10 below.

At block 904, process 900 processes the received feedback that isincluded in the feedback package. In one embodiment, process 900converts the received feedback package into an entry for a feedbacksearch index. In one embodiment, the feedback search index is a searchindex that incorporates the users feedback into scoring results. Forexample and in one embodiment, each engagement events for a (query,result) pair promotes that result for the corresponding query. In thisexample, if a user engages with a result for a particular query, then afuture user may also engagement with this result for the same query.Thus, in one embodiment, the result for this query would be returned andranked higher for a future user having the same query. Conversely, if auser abandons a result for a particular query, then a future user mayalso abandon this same result for the same query. Thus, in oneembodiment, the result for this query may be returned and ranked lowerfor a future user having the same query.

In one embodiment, process 900 converts the received feedback packageinto a feedback search index entry that has the format of <query,result, render counts, engagement counts, abandonment counts>, wherequery is the input query and context information such as, device type,application, locale, and geographic location, result is the renderresult, render counts is the number of times the result is rendered forthat query, engagement counts is the number of times the result isengaged for that query, and abandonment counts is the number of timesthat result is abandoned. In one embodiment, process 900 updates thisfeedback index entry in the feedback search index. In a furtherembodiment, each feedback package includes also unique sourceidentifiers that may include user identifiers, device identifiers, orsession identifiers, with or without methods to obfuscate identity topreserve privacy, where updating the feedback index entry append to theindex in the form of a citation index, with the unique sourceidentifiers being the source of the feedback citations. The feedbackindex can then be queried to provide results and weightings that arepersonalized or customized to individuals or groups of users. Processingthe received feedback is further described in FIG. 11 below.

Process 900 updates a results cache at block 906. In one embodiment, theresults cache is a cache that maps queries to results, which can be usedto quickly return results for a user query. In one embodiment, theresults cache is stored in an edge server that is close in proximity toa user's device that can be used to serve one or more results prior toperforming a query search (e.g., an edge server that is geographicallycloser to the client than other edge servers). In one embodiment,process 900 updates the results by running a set of queries using theupdated feedback search index to determine a set of results for thesequeries. The updated results are sent to each of the results cachesstored on the edge servers. Updating the results cache is furtherdescribed in FIG. 12 below.

FIG. 10 is a flow chart of one embodiment of a process 1000 to collectuser feedback during a user search session. In one embodiment, process100 is performed by a collect feedback module to collect user feedbackduring a user search session, such as the collect feedback module 838 asdescribed in FIG. 8 above. In FIG. 10, process 1000 begins by detectingan event that triggers the feedback collection. In one embodiment, theinitial event can be start of an input for the query prefix string, ofanother type of event. In one embodiment, if the user has participatedin a previous search session over a period of time (e.g., 15 minutes),this start of an input for the query prefix string marks the start of anew user search session and starts the recording of the user feedback.As described above, a search session is a set of events initiated by theuser beginning an input of a query prefix, tracking the user's actionsover a rough period of time (e.g., 15 minutes).

At block 1004, process 1000 records the events associated with the usersearch session. In one embodiment, process 1000 records render,engagement, and abandonment events. In one embodiment, a render event isthe relevant results that are rendered for the user in response to auser entering a query prefix or complete query. In one embodiment,process 1000 records the render event by recording the results presentedfor each query prefix or complete query. In addition, process 1000records engagement events at block 1004. In one embodiment, anengagement event is an event that occurs if the user interacts with oneof the rendered results presented to the user. For example and in oneembodiment, the user could click on a link that is presented for one ofthe rendered results. In another example, the user could click on thelink and spend a time greater than a predetermined time interacting withthe object (e.g., a website) referenced by that link (e.g., interactswith the referenced object for more than 60 seconds). In this example,the user may receive results directed towards a query search for thecurrent U.S. President and click on a link that references a web pagedescribing the latest presidential speech. If the user interacts withthe website for more than a predetermined time (e.g., 60-90 seconds),process 1000 would determined that the user engaged with the resultrepresented by that link. Thus, this would be an engagement event forthis result.

In a further embodiment, process 1000 can record abandonment events,where an abandonment event is an event where the user may ignore orabandon results rendered for the user. For example and in oneembodiment, if a user clicks on a link presented for one of the renderedresults, but navigates away from that website within a predeterminedtime (e.g., less than 60-90 seconds), process 900 determines that thisis an abandonment event for that result. In one embodiment, a usernavigates away by closing a tab or window presenting the website,changing focus to another application, or some other action thatindicates that the user is not interacting with the presented website.

At block 1006, process 1000 creates a feedback package from the recordedevents of the user's search session. In one embodiment, a user's searchsession ends by based on a predetermined time since the initial searchsession event (e.g., 15 minutes) or can be a predetermined time of userinactivity with regards to the user search session. For example and inone embodiment, if the user has no activity or is not interacting withthe results or other types of objects referenced by one of the resultsover a predetermined amount of time (e.g., 10 minutes), the user'ssearch session would end. In one embodiment, in response to the endingof a user's search session, process 1000 would collect the recordedevents and create a feedback package from this user search session. Inone embodiment, the feedback package includes a set of results renderedfor the user, the queries associated with those results, the engagementevents where the user engaged a results of a query, and the abandonmentevents where the user abandoned results rendered for the user, whereeach of the abandoned events is associated with a query. Process 1000sends this feedback package to the search network at block 1008. In oneembodiment, the client sends the feedback package to an edge server,where the edge server forwards the feedback package to the core serverfor processing.

FIG. 11 is a flow chart of one embodiment of a process 1100 toincorporate user feedback during into a feedback index. In oneembodiment, the process feedback module performs process feedbackmodule, such as the process feedback module 840 as described in FIG. 8above. In FIG. 11, process 1100 begins by receiving the feedback packageat block 1102. In one embodiment, the feedback package is the feedbackpackage of a user's search session as described in FIG. 10 above. Atblock 1104, process 1100 converts the feedback package into one or morefeedback index entries. In one embodiment, a feedback index entry is thenumber of events recorded for a particular query, result pair. Forexample and in one embodiment, a feedback index entry includes <query,result, render counts, engagement counts, abandonment counts>, wherequery is the input query and context information such as, device type,application, locale, and geographic location, result is the renderresult, render counts is the number of times the result is rendered forthat query, engagement counts is the number of times the result isengaged for that query, and abandonment counts is the number of timesthat result is abandoned.

At block 1106, process 1100 inserts the feedback index entry into afeedback index. In one embodiment, a feedback index is a search indexthat incorporates the user feedback into a search index. In oneembodiment, the feedback index is a citation index, where an engagementevent is a positive citation for the result and an abandonment event isa negative citation for that result. In one embodiment, a citationsearch index is described in U.S. patent application Ser. No.12/628,791, entitled “Ranking and Selecting Entities Based on CalculatedReputation or Influence Scores”, filed on Dec. 1, 2009 and isincorporated herein. In one embodiment, if the there is an entry in thefeedback index with the same query, result pair, process 1100 updatesthis entry with the number of event counts.

As described above, the user feedback incorporated the feedback indexcan be used to update a results cache. FIG. 12 is a flow chart of oneembodiment of a process 1200 to use the user feedback to update aresults cache. In one embodiment, an update results module performsprocess 1200 to update a results cache, such as the update resultsmodule 842 as described in FIG. 8 above. In FIG. 12, process 1200 beginsby receiving a results set RS that include multiple queries. In oneembodiment, the results set is a map between a set of queries andresults. This results set can be used for a result cache to quicklyreturn relevant results for query prefixes as described in FIG. 8 above.In one embodiment, the results sets is generated by a search index thatdoes not include user feedback. In another embodiment, the results setsis generated by a previous feedback index that incorporates previoususer feedback.

At block 1204, process 1200 runs each query from the results set RSagainst the current feedback index. Process 1200 uses the results fromthe run queries in block 1204 to create an update results set RS′ atblock 1206. In one embodiment, the results set RS′ is a feedbackweighted results set, where the results for a query that have a greaterengagement events are weighted higher in the feedback index and resultsfor that query that have greater abandonment events are weighted lowerin the feedback index. For example and in one embodiment, if a query Qin results set RS, would have results ranked as R₁, R₂, and R₃, and inthe updated feedback index has the these results for Q as R₁ having 20engagement events and 50 abandonment events, R₂ having 100 engagementevents and 2 abandonment events, and R₃ having 50 engagement events and10 abandonment events, running the query Q against the updated feedbackindex may return the ranked results as R₂, R₃, and R₁. Thus, in oneembodiment, using the feedback index will alter the ranking of theresults in the updated results set RS′. In another embodiment, therelevant results filter may have a rule that for a result to bepresented, the result may need at x number of engagement events or nomore than y abandonment events. Thus, in this embodiment, using thefeedback index may alter which results are presents and which are not.Process 1200 sends the updated results set RS′ to each of the edgeservers at block 1208. In one embodiment, process 1200 sends the updatedresults set RS′ from the core server 816 to the edge server 804 asdescribed in FIG. 8 above.

FIG. 13 is a block diagram of one embodiment of a federator 824 thatperforms a multi-domain search using a characterized query completion.In one embodiment, the federator includes completions module 1304,blender/ranker 1306, multiple search domains 1308A-F, and vocabularyservice 1314. In one embodiment, the completions module 1304 determinesthe query completions for each of the query prefixes as described inFIG. 6 above. The determined query completions are forwarded to theblender/ranker 1306, which uses the query completions to perform amulti-domain search for relevant results using search domains 1308A-F asdescribed in FIG. 7 above. In one embodiment, the search domains 1308A-Fare the search domains as described in FIG. 3 above. For example and inone embodiment, the maps search domain 1308A is search domain thatincludes information related to a geographical map as described in FIG.3 above. The maps search domain 1308A queries information from a mapsdata source 1310A. The media search domain 1308B is a search domainrelated to media as described in FIG. 3 above. The media search domain1308B queries information from a media data source 1310B. The wikisearch domain 1308C is an online encyclopedia search domain as describedin FIG. 3 above. The wiki search domain 1308C queries information from awiki data source 1310C. The sites search domain 1308D is a search domainof websites as described in FIG. 3 above. The sites search domain 1308Dqueries information from a sites data source 1310D. The other searchdomain is a set of other search domains that can be accessed by theblender/ranker 1306 as described in FIG. 3 above. The other searchdomain 1308E queries information from other data source(s) 1310E. In oneembodiment, the feedback search domain 1308F a search index that isbased on query feedback collected by browsers running on various devicesas described in FIG. 3. The feedback search domain 1308 queriesinformation from the feedback data source 1310F (e.g., the feedbacksearch index).

In addition, the blender/ranker 1306 receives the results from themultiple search domains 1308A-F and ranks these results. In oneembodiment, the blender/ranker 1306 characterizes each of the querycompletions using a vocabulary service 1302 that determines what type ofsearch is being performed. For example and in one embodiment, thevocabulary service 1302 can determine if the search is for a person,place, thing, etc. In one embodiment, the vocabulary service 1302 uses aknowledge base 1312 that maps words or phrases to a category. In thisembodiment, characterizing the query completion is used to weightresults returned by the search domains 1308A-F. For example and in oneembodiment, if the query completion is characterized to be a search fora place, the results from the maps search domain can be ranked higher aswell as a wiki entry about this place. As a further example, if thequery completion is indicated to be about an artist, the media searchdomain results can be ranked higher. Weighting the results is furtherdescribed in FIG. 14 below.

FIG. 14 is a flow chart of one embodiment of a process 1400 to determinerelevant results using a vocabulary service for the query completion. Inone embodiment, the blender/ranker 1306 performs process 1400 todetermine relevant results using a vocabulary service for the querycompletion as described in FIG. 13 above. In FIG. 14, process 1400begins by receiving query completions at block 1402. In one embodiment,the received query completions are the completions determined by process600 in response to receiving a query prefix. In one embodiment, process1400 performs blocks 1404 and 1408 in one parallel stream and blocks1406 and 1410 in another parallel stream. At block 1404, process 1400sends the query completions to the different search domains to determinepossible relevant results. In one embodiment, each of the search domainsuses the received query completions to determine relevant results forthat search domain. In one embodiment, the multiple search domainprocess each of the query completions in parallel. Process 1400 sendsthe query completion(s) to the vocabulary service to characterize eachof the completion(s). In one embodiment, the vocabulary servicecharacterizes each of the query completion(s) by determining if thequery completion(s) is a query about a person, place, thing, or anothertype of information. Characterizing the query completion(s) is furtherdescribed in FIG. 15 below. Process 1400 receives the search resultsfrom the multiple search domains at block 1408. In one embodiment, eachof the search results includes a set of scores that characterizes thatresult from the corresponding search domain.

At block 1410, process 1400 receives the vocabulary search resultscharacterizing the query completion(s). In one embodiment, thecharacterization of the query completion(s) indicates the type ofinformation that each query completion is searching for. For example andin one embodiment, the query completion(s) is a query about a person,place, thing, or another type of information. In one embodiment, the twoparallel streams converge at block 1412. Process 1400 uses the querycompletion characterization to rank and filter the relevant results forthat query completion at block 1412. In one embodiment, if the querycompletion is indicated to be a search for a person, the results fromthe wiki domain regarding a person results from the search may be rankedhigher. For example and in one embodiment, if the query completion ischaracterized as searching for a movie, the results from reviews orlocal show times of that movie can be ranked higher. As another example,if the query completion is indicated to be a place, the results from themaps search domain can be ranked higher as well as a wiki entry aboutthis place. As a further example, if the query completion is indicatedto be about an artist, the media search domain results can be rankedhigher. Ranking using query completion is also described in FIG. 7above. In another embodiment, the feedback index can be a signal domainthat is used to rank and/or filter the relevant results. In thisembodiment, process 1400 uses the number of engagement events to rankhigher a result and uses the number of abandonment events to rank lowera result. In one embodiment, process 1400 additionally ranks and filtersthe results as described in FIG. 7, block 708 above. Process 1400returns the ranked, filtered results at block 1414.

As described above, process 1400 uses a vocabulary service tocharacterize a query completion. FIG. 15 is a flow chart of oneembodiment of a process 1500 to characterize a query completion. In FIG.15, process 1500 receives the query completion(s) at block 1502. Atblock 1504, process 1500 tokenizes each query completion. In oneembodiment, tokenizing a completion is separating the query completioninto separate tokens (e.g., words, phrases, plural/singular variations).For the tokenized query completion, process 1500 determines a match forthe tokenized completion in a knowledge base. In one embodiment, theknowledge base is a database of words or phrases mapped to a category.For example and in one embodiment, the knowledge base can includeentries such as {Eiffel Tower→place}, {Michael Jackson→artist}, {BarackObama→president}, {Black Widow→spider}, etc. In one embodiment, theknowledge base is built using an ontology. In one embodiment, process1500 uses a term frequency matching algorithm to determine a match ofthe query completion in the knowledge base. For example and in oneembodiment, if the query completion is “Who is Michael Jackson?” process1500 can match on the terms “Michael,” “Jackson,” or “Michael Jackson”.In this example, process 1500 would try to find the longest match in theknowledge database. If the knowledge base has matches for “Michael,”“Jackson,” and “Michael Jackson,” the match for “Michael Jackson” wouldbe used. If there is a match for one or more of the query completions,process 1500 returns the match(es) at block 1508. For example and in oneembodiment, process 150 can return “person,” “artist,” or another typeof characterization for the query completion “Who is Michael Jackson?”If there are no matches, process 1500 return with no characterizations.

FIG. 16 is a block diagram of one embodiment of a completion module 1600to determine query completions from multiple search domains. In oneembodiment, the completion module 1600 includes receive query prefixmodule 1602, send prefix module 1604, receive completion module 1606,rank & filter completions module 1608, and send completions module 1610.In one embodiment, the receive query prefix module 1602 receives thequery prefixes as described in FIG. 6, block 602 above. The send prefixmodule 1604 sends the query prefixes to the different search domains asdescribed in FIG. 6, block 604 above. The receive completion module 1606receives the query completion as described in FIG. 6, block 606 above.The rank & filter completions module 1608 ranks and filters the receivedquery completions as described in FIG. 6, block 608 above. The sendcompletions module 1610 sends the query completions to the relevantresults module as described in FIG. 6, block 610 above.

FIG. 17 is a block diagram of one embodiment of a results module 1700 todetermine relevant results over multiple search domains from adetermined query completion. In one embodiment, the results module 1700includes a receive query completions module 1702, send completionsmodule 1704, receive query results module 1706, rank and filter module1708, and return results module 1710. In one embodiment, the receivequery completions module 1702 receives the query completions asdescribed in FIG. 7, block 702 above. The send completions module 1704sends the completions to the multiple search domains as described inFIG. 7, block 704 above. The receive query results module 1706 receivesthe query results from the multiple search domains as described in FIG.7, block 706 above. The rank and filter module 1708 ranks and filtersthe query results as described in FIG. 7, block 708 above. The returnresults module 1710 returns the query results as described in FIG. 7,block 710 above.

FIG. 18 is a block diagram of one embodiment of a collect feedbackmodule 838 to collect user feedback during a user search session. In oneembodiment, the collect feedback module 838 includes a detect renderevent module 1802, record events module 1804, create feedback packagemodule 1806, and send feedback module 1808. In one embodiment, thedetect initial event module 1802 detects an initial event to start auser search session as described in FIG. 10, block 1002 above. Therecord events module 1804 records the events during the user searchsession as described in FIG. 10, block 1004 above. The create feedbackpackage module 1806 create a feedback package as described in FIG. 10,block 1006 above. The send feedback module 1808 sends the feedbackpackage as described in FIG. 10, block 1008 above.

FIG. 19 is a block diagram of one embodiment of a process feedbackmodule 840 to incorporate user feedback during into a feedback index. Inone embodiment, the process feedback module 840 includes a receivefeedback package module 1902, convert feedback package module 1904, andinsert feedback entry module 1906. In one embodiment, the receivefeedback package module 1902 receives the feedback module as describedin FIG. 11, block 1102. The convert feedback package module 1904converts the feedback package as described in FIG. 11, block 1104. Theinsert feedback entry module 1906 insert a feedback index entry asdescribed in FIG. 11, block 1106.

FIG. 20 is a block diagram of one embodiment of an update query resultsmodule 842 to use the user feedback to update a results cache. In oneembodiment, the update results cache 842 includes a receive results setmodule 2002, run query module, 2004, update results set module 2006, andsend updated results module 2008. In one embodiment, the receive resultsset module 2002 receives the results set as described in FIG. 12, block1202. The run query module 2004 runs the queries using the feedbackindex as described in FIG. 12, block 1204. The update results set module2006 updates the results set as described in FIG. 12, block 1206. Thesend updated results module 2008 sends the updated results set asdescribed in FIG. 12, block 1202.

FIG. 21 is a block diagram of one embodiment of a relevant resultsmodule 2100 to determine relevant results using a vocabulary service forthe query completion. In one embodiment, the relevant results module2100 includes a receive completions module 2102, send completions module2104, vocabulary completion module 2106, receive results module 2108,receive vocabulary results module 2110, rank results module 2112, andreturn results module 2114. In one embodiment, the receive completionsmodule 2102 receives the query completions as described in FIG. 14,block 1402. The send completions module 2104 sends the query completionsto the multiple search domains receives the query completions asdescribed in FIG. 14, block 1404. The vocabulary completion module 2106sends the query completions to the vocabulary service as described inFIG. 14, block 1406. The receive results module 2108 receives the queryresults from the multiple search domains as described in FIG. 14, block1408. The receive vocabulary results module 2110 receives the vocabularyservice characterization as described in FIG. 14, block 1410. The rankresults module 2112 ranks the search domain results as described in FIG.14, block 1412. The return results module 2114 returns the ranks resultsas described in FIG. 14, block 1414.

FIG. 22 is a block diagram of one embodiment of a characterize querymodule 2200 to characterize a query completion. In one embodiment, thecharacterize query results module 2200 includes a receive completionsmodule 2202, tokenize completions module 2204, find match module 2206,and return characterization module 2208. In one embodiment, the receivecompletions module 2202 receives the completions as described in FIG.15, block 1502 above. The tokenize completions module 2204 tokenizes thecompletions as described in FIG. 15, block 1504 above. The find matchmodule 2206 find a match for the tokenized completion in the knowledgebase as described in FIG. 15, block 1506 above. The returncharacterization module 2208 returns the characterization as describedin FIG. 15, block 1508 above.

FIG. 23 shows one example of a data processing system 2300, which may beused with one embodiment of the present invention. For example, thesystem 2300 may be implemented including a device 100 as shown inFIG. 1. Note that while FIG. 23 illustrates various components of acomputer system, it is not intended to represent any particulararchitecture or manner of interconnecting the components as such detailsare not germane to the present invention. It will also be appreciatedthat network computers and other data processing systems or otherconsumer electronic devices, which have fewer components or perhaps morecomponents, may also be used with the present invention.

As shown in FIG. 23, the computer system 2300, which is a form of a dataprocessing system, includes a bus 2303 which is coupled to amicroprocessor(s) 2305 and a ROM (Read Only Memory) 2307 and volatileRAM 2309 and a non-volatile memory 2311. The microprocessor 2305 mayinclude one or more CPU(s), GPU(s), a specialized processor, and/or acombination thereof. The microprocessor 2305 may retrieve theinstructions from the memories 2307, 2309, 2311 and execute theinstructions to perform operations described above. The bus 2303interconnects these various components together and also interconnectsthese components 2305, 2307, 2309, and 2311 to a display controller anddisplay device 2313 and to peripheral devices such as input/output (I/O)devices which may be mice, keyboards, modems, network interfaces,printers and other devices which are well known in the art. Typically,the input/output devices 2315 are coupled to the system throughinput/output controllers 2313. The volatile RAM (Random Access Memory)2309 is typically implemented as dynamic RAM (DRAM), which requirespower continually in order to refresh or maintain the data in thememory.

The mass storage 2311 is typically a magnetic hard drive or a magneticoptical drive or an optical drive or a DVD RAM or a flash memory orother types of memory systems, which maintain data (e.g. large amountsof data) even after power is removed from the system. Typically, themass storage 2311 will also be a random access memory although this isnot required. While FIG. 23 shows that the mass storage 2311 is a localdevice coupled directly to the rest of the components in the dataprocessing system, it will be appreciated that the present invention mayutilize a non-volatile memory which is remote from the system, such as anetwork storage device which is coupled to the data processing systemthrough a network interface such as a modem, an Ethernet interface or awireless network. The bus 2303 may include one or more buses connectedto each other through various bridges, controllers and/or adapters as iswell known in the art.

FIG. 24 shows an example of another data processing system 2400 whichmay be used with one embodiment of the present invention. For example,system 2400 may be implemented as a device 100 as shown in FIG. 1. Thedata processing system 2400 shown in FIG. 24 includes a processingsystem 2411, which may be one or more microprocessors, or which may be asystem on a chip integrated circuit, and the system also includes memory2401 for storing data and programs for execution by the processingsystem. The system 2400 also includes an audio input/output subsystem2405, which may include a microphone and a speaker for, for example,playing back music or providing telephone functionality through thespeaker and microphone.

A display controller and display device 2409 provide a visual userinterface for the user; this digital interface may include a graphicaluser interface which is similar to that shown on a Macintosh computerwhen running OS X operating system software, or Apple iPhone whenrunning the iOS operating system, etc. The system 2400 also includes oneor more wireless transceivers 2403 to communicate with another dataprocessing system, such as the system 2400 of FIG. 24. A wirelesstransceiver may be a WLAN transceiver, an infrared transceiver, aBluetooth transceiver, and/or a wireless cellular telephony transceiver.It will be appreciated that additional components, not shown, may alsobe part of the system 2400 in certain embodiments, and in certainembodiments fewer components than shown in FIG. 24 may also be used in adata processing system. The system 2400 further includes one or morecommunications ports 2417 to communicate with another data processingsystem, such as the system 1500 of FIG. 15. The communications port maybe a USB port, Firewire port, Bluetooth interface, etc.

The data processing system 2400 also includes one or more input devices2413, which are provided to allow a user to provide input to the system.These input devices may be a keypad or a keyboard or a touch panel or amulti touch panel. The data processing system 2400 also includes anoptional input/output device 2415 which may be a connector for a dock.It will be appreciated that one or more buses, not shown, may be used tointerconnect the various components as is well known in the art. Thedata processing system shown in FIG. 24 may be a handheld computer or apersonal digital assistant (PDA), or a cellular telephone with PDA likefunctionality, or a handheld computer which includes a cellulartelephone, or a media player, such as an iPod, or devices which combineaspects or functions of these devices, such as a media player combinedwith a PDA and a cellular telephone in one device or an embedded deviceor other consumer electronic devices. In other embodiments, the dataprocessing system 2400 may be a network computer or an embeddedprocessing device within another device, or other types of dataprocessing systems, which have fewer components or perhaps morecomponents than that shown in FIG. 24.

At least certain embodiments of the inventions may be part of a digitalmedia player, such as a portable music and/or video media player, whichmay include a media processing system to present the media, a storagedevice to store the media and may further include a radio frequency (RF)transceiver (e.g., an RF transceiver for a cellular telephone) coupledwith an antenna system and the media processing system. In certainembodiments, media stored on a remote storage device may be transmittedto the media player through the RF transceiver. The media may be, forexample, one or more of music or other audio, still pictures, or motionpictures.

The portable media player may include a media selection device, such asa click wheel input device on an iPod® or iPod Nano® media player fromApple, Inc. of Cupertino, Calif., a touch screen input device,pushbutton device, movable pointing input device or other input device.The media selection device may be used to select the media stored on thestorage device and/or the remote storage device. The portable mediaplayer may, in at least certain embodiments, include a display devicewhich is coupled to the media processing system to display titles orother indicators of media being selected through the input device andbeing presented, either through a speaker or earphone(s), or on thedisplay device, or on both display device and a speaker or earphone(s).Examples of a portable media player are described in published U.S. Pat.No. 7,345,671 and U.S. published patent number 2004/0224638, both ofwhich are incorporated herein by reference.

Portions of what was described above may be implemented with logiccircuitry such as a dedicated logic circuit or with a microcontroller orother form of processing core that executes program code instructions.Thus processes taught by the discussion above may be performed withprogram code such as machine-executable instructions that cause amachine that executes these instructions to perform certain functions.In this context, a “machine” may be a machine that converts intermediateform (or “abstract”) instructions into processor specific instructions(e.g., an abstract execution environment such as a “virtual machine”(e.g., a Java Virtual Machine), an interpreter, a Common LanguageRuntime, a high-level language virtual machine, etc.), and/or,electronic circuitry disposed on a semiconductor chip (e.g., “logiccircuitry” implemented with transistors) designed to executeinstructions such as a general-purpose processor and/or aspecial-purpose processor. Processes taught by the discussion above mayalso be performed by (in the alternative to a machine or in combinationwith a machine) electronic circuitry designed to perform the processes(or a portion thereof) without the execution of program code.

The present invention also relates to an apparatus for performing theoperations described herein. This apparatus may be specially constructedfor the required purpose, or it may comprise a general-purpose computerselectively activated or reconfigured by a computer program stored inthe computer. Such a computer program may be stored in a computerreadable storage medium, such as, but is not limited to, any type ofdisk including floppy disks, optical disks, CD-ROMs, andmagnetic-optical disks, read-only memories (ROMs), RAMs, EPROMs,EEPROMs, magnetic or optical cards, or any type of media suitable forstoring electronic instructions, and each coupled to a computer systembus.

A machine readable medium includes any mechanism for storing ortransmitting information in a form readable by a machine (e.g., acomputer). For example, a machine readable medium includes read onlymemory (“ROM”); random access memory (“RAM”); magnetic disk storagemedia; optical storage media; flash memory devices; etc.

An article of manufacture may be used to store program code. An articleof manufacture that stores program code may be embodied as, but is notlimited to, one or more memories (e.g., one or more flash memories,random access memories (static, dynamic or other)), optical disks,CD-ROMs, DVD ROMs, EPROMs, EEPROMs, magnetic or optical cards or othertype of machine-readable media suitable for storing electronicinstructions. Program code may also be downloaded from a remote computer(e.g., a server) to a requesting computer (e.g., a client) by way ofdata signals embodied in a propagation medium (e.g., via a communicationlink (e.g., a network connection)).

The preceding detailed descriptions are presented in terms of algorithmsand symbolic representations of operations on data bits within acomputer memory. These algorithmic descriptions and representations arethe tools used by those skilled in the data processing arts to mosteffectively convey the substance of their work to others skilled in theart. An algorithm is here, and generally, conceived to be aself-consistent sequence of operations leading to a desired result. Theoperations are those requiring physical manipulations of physicalquantities. Usually, though not necessarily, these quantities take theform of electrical or magnetic signals capable of being stored,transferred, combined, compared, and otherwise manipulated. It hasproven convenient at times, principally for reasons of common usage, torefer to these signals as bits, values, elements, symbols, characters,terms, numbers, or the like.

It should be kept in mind, however, that all of these and similar termsare to be associated with the appropriate physical quantities and aremerely convenient labels applied to these quantities. Unlessspecifically stated otherwise as apparent from the above discussion, itis appreciated that throughout the description, discussions utilizingterms such as “detecting,” “ranking,” “receiving,” “determining,”“computing,” “sending,” “modifying,” “tokenize,” “filtering,” “adding,”“creating,” finding,” or the like, refer to the action and processes ofa computer system, or similar electronic computing device, thatmanipulates and transforms data represented as physical (electronic)quantities within the computer system's registers and memories intoother data similarly represented as physical quantities within thecomputer system memories or registers or other such information storage,transmission or display devices.

The processes and displays presented herein are not inherently relatedto any particular computer or other apparatus. Various general-purposesystems may be used with programs in accordance with the teachingsherein, or it may prove convenient to construct a more specializedapparatus to perform the operations described. The required structurefor a variety of these systems will be evident from the descriptionbelow. In addition, the present invention is not described withreference to any particular programming language. It will be appreciatedthat a variety of programming languages may be used to implement theteachings of the invention as described herein.

The foregoing discussion merely describes some exemplary embodiments ofthe present invention. One skilled in the art will readily recognizefrom such discussion, the accompanying drawings and the claims thatvarious modifications can be made without departing from the spirit andscope of the invention.

What is claimed is:
 1. A non-transitory machine-readable medium havingexecutable instructions to cause one or more processing units to performa method to generate a plurality of ranked completions using a queryprefix over a plurality of separate search domains, the methodcomprising: receiving the query prefix from a client of a user;determining a plurality of search completions across the plurality ofseparate search domains, wherein each of the plurality of searchcompletions has a search domain score and a frequency score calculatedby the corresponding search domain, each of the plurality of separatesearch domains has a different scoring metric for the search domainscore based on a different type of scoring input that is used tocalculate the search domain score for a search completion from thatsearch domain, each of the plurality of separate search domain has aseparate query completion tree, and the frequency score for a searchcompletion is based on at least a number of times that search completionmatched the query prefix within that search domain; and ranking theplurality of search completions based on the score calculated for eachof the plurality of search completions determined by a correspondingsearch domain, wherein at least one of the plurality of searchcompletions is used to generate a plurality of search results without anindication from the user and in response to receiving the query prefix.2. The non-transitory machine-readable medium of claim 1, furthercomprising: filtering the plurality of search completions.
 3. Thenon-transitory machine-readable medium of claim 1, wherein the each ofthe plurality of separate search domains is selected from the groupconsisting of maps search domain, media store search domain, onlineencyclopedia search domain, and sites search domain.
 4. Thenon-transitory machine-readable medium of claim 1, wherein the frequencyscore for one of the plurality of search completions is a raw score ofthat search completion that is a frequency of times this searchcompletion has matched the query prefix.
 5. The non-transitorymachine-readable medium of claim 4, wherein the frequency score for oneof the plurality of search completions is a local score for that searchcompletion that is based on this search completion raw score and anumber of possible other search completions using this search completionas a prefix.
 6. The non-transitory machine-readable medium of claim 4,wherein the frequency score for one of the plurality of searchcompletions is a global score for that search completion that is basedon this search completion raw score and a number of possible othersearch completions in the search domain.
 7. The non-transitorymachine-readable medium of claim 1, wherein query prefix includes aninput string and a context, and the input string is input by the user.8. The non-transitory machine-readable medium of claim 7, wherein thecontext includes a location, a device type, an application identifier,and a locale.
 9. A method to generate a plurality of ranked completionsusing a query prefix over a plurality of separate search domains, themethod comprising: receiving the query prefix from a client of a user;determining a plurality of search completions across the plurality ofseparate search domains, wherein each of the plurality of searchcompletions has a search domain score and a frequency score calculatedby the corresponding search domain, each of the plurality of separatesearch domains has a different scoring metric for the search domainscore based on a different type of scoring input that is used tocalculate the search domain score for a search completion from thatsearch domain, the plurality of separate search domain has a separatequery completion tree, and the frequency score for a search completionis based on at least a number of times that search completion matchedthe query prefix; and ranking the plurality of search completions basedon a score calculated for each of the plurality of search completionsdetermined by a corresponding search domain, wherein at least one of theplurality of search completions is used to generate a plurality ofsearch results without an indication from the user and in response toreceiving the query prefix within that search domain.
 10. The method ofclaim 9, further comprising: filtering the plurality of searchcompletions.
 11. The method of claim 9, wherein the each of theplurality of separate search domains is selected from the groupconsisting of maps search domain, media store search domain, onlineencyclopedia search domain, and sites search domain.
 12. The method ofclaim 9, wherein the frequency score for one of the plurality of searchcompletions is a raw score of that search completion that is thefrequency of times this search completion has matched the query prefix.13. The method of claim 12, wherein the frequency score for one of theplurality of search completions is a local score for that searchcompletion that is based on this search completion raw score and anumber of possible other search completions using this search completionas a prefix.
 14. The method of claim 12, wherein the frequency score forone of the plurality of search completions is a global score for thatsearch completion that is based on this search completion raw score anda number of possible other search completions in the search domain. 15.The method of claim 9, wherein query prefix includes an input string anda context, and the input string is input by the user.
 16. The method ofclaim 15, wherein the context includes a location, a device type, anapplication identifier, and a locale.
 17. A device to generate aplurality of ranked completions using a query prefix over a plurality ofseparate search domains, the device comprising: at least one processor;a memory coupled to the processor though a bus; and a process executedfrom the memory by the processor that causes the processor to receivethe query prefix from a client of a user, determine a plurality ofsearch completions across the plurality of separate search domains, andrank the plurality of search completions based on a search domain scoreand a frequency score calculated for each of the plurality of searchcompletions determined by a corresponding search domain, wherein each ofthe plurality of search completion has the corresponding scorecalculated by the corresponding search domain, each of the plurality ofseparate search domains has a different scoring metric for the searchdomain score based on a different type of scoring inputs that is used tocalculate the search domain score for a search completion from thatsearch domain, each of the plurality of separate search domain has aseparate query completion tree, the frequency score for a searchcompletion is based on at least a number of times that search completionmatched the query prefix within that search domain, and at least one ofthe plurality of search completions is used to generate a plurality ofsearch results without an indication from the user and in response toreceiving the query prefix.
 18. The device of claim 17, wherein theprocess further causes the processor to filter the plurality of searchcompletions.
 19. The device of claim 17, wherein the each of theplurality of separate search domains is selected from the groupconsisting of maps search domain, media store search domain, onlineencyclopedia search domain, and sites search domain.
 20. The device ofclaim 17, wherein the score for one of the plurality of searchcompletions is a raw score of that search completion that is thefrequency of times this search completion has been received.